Maximizing Antichains in the Cube With Fixed Size of a Shadow
نویسنده
چکیده
In the n-dimensional cube, we determine the maximum size of antichains having a lower shadow of exactly m elements in the k-th level.
منابع مشابه
Bijective mapping preserving intersecting antichains for k-valued cubes
Generalizing a result of Miyakawa, Nozaki, Pogosyan and Rosenberg, we prove that there is a one-to-one correspondence between the set of intersecting antichains in a subset of the lower half of the kvalued n-cube and the set of intersecting antichains in the k-valued (n− 1)-cube.
متن کاملInstitutional Quality, Natural Resource Rent, and Shadow Economy
Natural resource rent affects countries’ economies through various channels. Revenues from the natural resources sales are expected to boost countries' economic growth, but the economic experience of recent decades reveals the numerous economic problems in these countries, the most important of which may be the increase in the shadow economy size. Moreover, the institutions specify the signific...
متن کاملLarge Shadows from Sparse Inequalities
The d-dimensional Goldfarb cube is a polytope with the property that all its 2 vertices appear on some shadow of it (projection onto a 2-dimensional plane). The Goldfarb cube is the solution set of a system of 2d linear inequalities with at most 3 variables per inequality. We show in this paper that the d-dimensional Klee-Minty cube — constructed from inequalities with at most 2 variables per i...
متن کاملOptimal antichains and ideals in Macaulay posets
A ranked poset P is a Macaulay poset if there exists a linear ordering of its elements such that for any i and any subset F of the i{th level N i the shadow of the jFj smallest elements of N i w.r.t. is contained in the set of the smallest j(F)j elements of N i?1 , where (F) denotes the shadow of F. We consider the following three optimization problems for P : (i) Find the maximum weight of an ...
متن کاملNonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer
A double-sided shadow minimization problem in the Boolean cube layer is investigated in this paper. The problem is to minimize the size of the union of the lower and upper shadows of a k-uniform family of subsets of [n]. It is shown that if 3 ≤ k ≤ n− 3, there is no total order such that all its initial segments have minimal double-sided shadow. Denote by ([n] k ) the family of all subsets of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992